Finite constants: characterizations of a new decidable set of constants
نویسندگان
چکیده
منابع مشابه
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs working on integers even if guards are ignored as in non-deterministic flow graphs. We show that polynomial constants are decidable in non-deterministic flow graphs. In polynomial constant propagation, assignment state...
متن کاملbottleneck constants of finite graphs
In this note we consider an example to test three lower bounds presented in Diaconis– Stroock [4] (one by Diaconis and Stroock (DS), another by Sinclair (S) [9], and the third by Jerrum–Sinclair (JS) [8]) of the first positive eigenvalue of a finite graph. The lower bounds are quite sharp in many of the examples studied in [4], and seem to measure the bottlenecks or complexity of the graphs stu...
متن کاملNew Criteria for Existence of a Class of Generalized Euler-types Constants
One of the most important mathematical constants is Euler-Mascheroni constant that is the limit of the sequence -------------------------------- and is denoted by gamma. Some other developed constants known as Euler type constants are introduced in order to generalize the above constant. In the present paper, inspired by the functional sequence derivative of the limit summand of functions (i...
متن کاملA New Numerical Procedure for Determination of Effective Elastic Constants in Unidirectional Composite Plates
In this paper a composite plate with similar unidirectional fibers is considered. Assuming orthotropic structure, theory of elasticity is used for investigating the stress concentration. Also, complex variable functions are utilized for solving the plane stress problems. Then the effective characteristics of this plate are studied numerically by using ANSYS software. In this research a volume e...
متن کاملKronecker Constants for Finite Subsets of Integers
A set of integers S is called ε-Kronecker if every function on S of modulus one can be approximated uniformly to within ε by a character. The least such ε is called the ε-Kronecker constant. We transform the problem of calculating ε-Kronecker constants for finite sets of d elements into a geometric optimization problem. Using this approach we can explicitly determine the ε-Kronecker constant fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90392-f